Game Characterizations of Process Equivalences
نویسندگان
چکیده
In this paper we propose a hierarchy of games that allows us to make a systematic comparison of process equivalences by characterizing process equivalences as games. The well-known linear/branching time hierarchy of process equivalences can be embedded into the game hierarchy, which not only provides us with a refined analysis of process equivalences, but also offers a guidance to defining interesting new process equivalences.
منابع مشابه
Game Characterizations of Timed Relations for Timed Automata Processes
In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling’s bisimulation games. If it is the case that the existence of a winning strategy for the defender in a game G1 implies that there exists a winning strategy for the defender in anothe...
متن کاملA Hierarchy of Equivalences for Probabilistic Processes
We study several process equivalences on a probabilistic process algebra. First, we define an operational semantics. Afterwards we introduce the notion of passing a test with a probability. We consider three families of tests according to the intended behavior of an external observer: Reactive (sequential tests), generative (branching tests), and limited generative (equitable branching tests). ...
متن کاملSemantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for -calculi ?
Coinductive (applicative) characterizations of various observational congruences which arise in the semantics of-calculus, for various reduction strategies, are discussed. Two semantic techniques for establishing the coincidence of the applicative and the contextual equivalences are analyzed. The rst is based on intersection types, the second is based on a mixed induction-coinduction principle.
متن کاملA survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
Behavioral equivalences are a means to establish whether computing systems possess the same properties. The specific set of properties that are preserved by a specific behavioral equivalence clearly depends on how the system behavior is observed and can usually be characterized by means of a modal logic. In this paper we consider three different approaches to the definition of behavioral equiva...
متن کاملUniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes
Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equivalence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations of the corresponding variants of trace equivalence rely on similar modal languages, each including only true and diamond. Unfortunately, this is not the case ...
متن کامل